A Tableau Cal ulus for Temporal Des ription Logi : TheConstant Domain Case

A Tableau Calculus for Temporal Description Logic : TheConstant Domain Case

We show how to combine the standard tableau system for the basic description logic ALC with Wolper's tableau calculus for propositional temporal logic PTL in order to design a terminating sound and complete tableau-based satissability-checking algorithm for the temporal description logic PTL ALC of 19] interpreted in models with constant domains. We use the method of quasimodels 16, 14] to repr...

Situation Cal ulus as Hybrid Logi : First Steps ?

Hybrid Reasoning for Des ription Logi s with Transitive Roles and Axioms

Ö Blockinøø Blockinøùööð Ëô Blockin Blockin¬ Blockin Blockinøøóò¸üôðóööøøóò Òò Ëëñùððøøóò Ììöóùùù Êêûööøøòò¹äóóó

In re ent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the spe i ation of pro essor ar hite tures. In their approa h pro essors spe i ed by term rewriting systems are translated into a standard hardware des ription language for simulation purposes. In this work we present our urrent investigation on the use of Rewriting-Logi , whi h is a more powerful theore...

Towards a Mathematical Services

P H Y S IC A L D E S C R IP T IO N Figure 1. Mathemati al Servi e Des ription Language Layers 2.1 Problem Class We begin by attempting a lassi ation/taxonomy of problem lasses. This rst oarse distin tion is intended as a guideline on how to further spe ify a spe i problem instan e. The underlying idea is that a omputing problem might have a di erent des ription from a proving problem. For insta...